Multimode Tree-Coding of Speech with Pre-/Post-Weighting

نویسندگان

چکیده

As speech-coding standards have improved over the years, so complexity has increased, and less emphasis been placed on low encoding/decoding delay. We present a low-complexity, low-delay speech codec based tree-coding with sample-by-sample adaptive long- short-code generators that incorporates pre- post-filtering for perceptual weighting multimode classification comfort noise generation (CNG). The pre-/post-weighting filters adapt code generator parameters available at both encoder decoder rather than usual method uses input speech. coding of multiple modes is accomplished using adaptation algorithms, again, Codec comparisons are presented operational rate distortion curves several standardized codecs new given. Finally, performance shown in relation to theoretical bounds.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multimode Tree Coding of Speech with Perceptual Pre-weighting and Post-weighting

A low delay and low complexity speech coder based on Multimode Tree Coding is proposed. In our Multimode Tree Coder, a simple mode classification method along with frame energy are used to classify the input speech frames into five different modes. Each mode is coded at a suitable bit-rate using a Tree coder with computationally efficient perceptual error pre-weighting and post-weighting filter...

متن کامل

Analysis-by-synthesis low-rate multimode harmonic speech coding

This paper presents an analysis-by-synthesis multimode harmonic coder (AbS-MHC) that employs new techniques to improve both the speech model accuracy and the parameter estimation robustness in the low rate harmonic coding framework. To improve the speech model accuracy, an enhanced frequency domain transition model is used in conjunction with the sinusoidal model based harmonic coding of voiced...

متن کامل

Implementing the Context - Tree Weighting Method : Arithmetic Coding

The context-tree weighting algorithm 6] is an eecient universal source coding method for tree sources. Although a nite accuracy version of this algorithm has been analysed in 8], it is better to implement the algorithm as proposed in 7]. There it was suggested to store in each node s of the context tree, instead of an estimated probability P s e and a weighted probability P s w , the (logarithm...

متن کامل

Efficient sub-optimal temporal decomposition with dynamic weighting of speech signals for coding applications

The Optimized Temporal Decomposition (OTD) technique for Line Spectral Frequencies (LSF) speech envelope representation, under a MMSE criterion, has been shown to be promising for very low bit rate speech coding for storage and broadcast applications. In order to improve perceptual speech quality, a dynamically weighted OTD (DW-OTD) technique is introduced in this work. It extends the OTD by al...

متن کامل

Arithmetic Coding with Adaptive Context-Tree Weighting for the H.264 Video Coders

We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effectiveness of using the method with that of using the context models specified in the H.264 standard. We then describe a novel approach for automatically adapting the CTW method based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app12042026